Edge Splitting-off and Network Design Problems
نویسندگان
چکیده
Edge Splitting-off and Network Design Problems
منابع مشابه
Approximate Integer Decompositions for Undirected Network Design Problems
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary of this theorem is that every 2k-edge-connected graph has k edge-disjoint spanning trees. We show that the splitting-off theorem of Mader in undirected graphs implies a generalization of this to finding k edgedisjoint ...
متن کاملSplitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
Splitting off a pair su; sv of edges in a graph G means the operation that deletes su and sv and adds a new edge uv. Given a graph G = (V + s;E) which is k-edge-connected (k 2) between vertices of V and a specified subset R V , first we consider the problem of finding a longest possible sequence of disjoint pairs (splittings) of edges sx; sy, x; y 2 R which can be split off preserving k-edge-co...
متن کاملConstrained Edge-Splitting Problems
Splitting off two edges su, sv in a graph G means deleting su, sv and adding a new edge uv. Let G = (V + s,E) be k-edge-connected in V (k ≥ 2) and let d(s) be even. Lovász proved that the edges incident to s can be split off in pairs in a such a way that the resulting graph on vertex set V is k-edge-connected. In this paper we investigate the existence of such complete splitting sequences when ...
متن کاملA Fast Edge-Splitting Algorithm in Edge-Weighted Graphs
Let H be a graph with a designated vertex s, where edges are weighted by nonnegative reals. Splitting edges e = {u, s} and e′ = {s, v} at s is an operation that reduces the weight of each of e and e′ by a real δ > 0 while increasing the weight of edge {u, v} by δ. It is known that all edges incident to s can be split off while preserving the edge-connectivity of H and that such a complete split...
متن کاملConnectivity-splitting models for survivable network design
The survivable network design (SND) problem seeks a minimum cost robust network configuration that provides a specified number of alternate (edge-disjoint) paths between nodes of the network. For this problem, we present a family of new mixed integer programming formulations whose associated linear programming relaxations can be tighter than that of the usual cutset formulation. The new formula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009